def gcd(a,b):
    if b==0:
        return a
    else:
        return gcd(b, remainder(a, b))
 

def gcd_1(a,b):
    while(b>0):
        rem = remainder(a,b)
        a = b
        b = rem
    return a
 
def remainder(x,y):
    return x%y
 
if __name__=='__main__':
    a = int(input("请输入一个正数:"))
    b = int(input("请输入另外一个正数:"))
    print("最大公约数：",gcd(a,b))